Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(h(x)) |
→ f(i(x)) |
| 2: |
|
f(i(x)) |
→ a |
| 3: |
|
i(x) |
→ h(x) |
|
There are 2 dependency pairs:
|
| 4: |
|
F(h(x)) |
→ F(i(x)) |
| 5: |
|
F(h(x)) |
→ I(x) |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
The usable rules are {3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006